Search Results

Documents authored by Brim, Luboš

Found 2 Possible Name Variants:

Brim, Luboš

Document
DOI: 10.4230/DagSemProc.09491.1
09491 Abstracts Collection – Graph Search Engineering

Authors: Lubos Brim, Stefan Edelkamp, Eric A. Hansen, and Peter Sanders

Published in: Dagstuhl Seminar Proceedings, Volume 9491, Graph Search Engineering (2010)

Abstract
From the 29th November to the 4th December 2009, the Dagstuhl Seminar 09491 ``Graph Search Engineering '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Lubos Brim, Stefan Edelkamp, Eric A. Hansen, and Peter Sanders. 09491 Abstracts Collection – Graph Search Engineering. In Graph Search Engineering. Dagstuhl Seminar Proceedings, Volume 9491, pp. 1-31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{brim_et_al:DagSemProc.09491.1,
  author =	{Brim, Lubos and Edelkamp, Stefan and Hansen, Eric A. and Sanders, Peter},
  title =	{{09491 Abstracts Collection – Graph Search Engineering}},
  booktitle =	{Graph Search Engineering},
  pages =	{1--31},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9491},
  editor =	{Lubos Brim and Stefan Edelkamp and Erik A. Hansen and Peter Sanders},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09491.1},
  URN =		{urn:nbn:de:0030-drops-24315},
  doi =		{10.4230/DagSemProc.09491.1},
  annote =	{Keywords: Model Checking, Artificial Intelligence, AI Planning, State Explosion Problem, Error Detection, Protocol Analysis, Software Verification and Validation, Heuristics, Pattern/Abstraction Databases, I/O Efficient Search, Solid State Disks, GPU}
}
Document
DOI: 10.4230/DROPS.MEMICS.2009.2348
Faster Algorithm for Mean-Payoff Games

Authors: Jakub Chaloupka and Luboš Brim

Published in: OASIcs, Volume 13, Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) (2009)

Abstract
We study some existing techniques for solving mean-payoff games (MPGs), improve them, and design a randomized algorithm for solving MPGs with currently the best expected complexity.
Cite as

Jakub Chaloupka and Luboš Brim. Faster Algorithm for Mean-Payoff Games. In Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). Open Access Series in Informatics (OASIcs), Volume 13, pp. 53-61, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{chaloupka_et_al:OASIcs:2009:DROPS.MEMICS.2009.2348,
  author =	{Chaloupka, Jakub and Brim, Lubo\v{s}},
  title =	{{Faster Algorithm for Mean-Payoff Games}},
  booktitle =	{Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09)},
  pages =	{53--61},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-15-6},
  ISSN =	{2190-6807},
  year =	{2009},
  volume =	{13},
  editor =	{Hlinen\'{y}, Petr and Maty\'{a}\v{s}, V\'{a}clav and Vojnar, Tom\'{a}\v{s}},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DROPS.MEMICS.2009.2348},
  URN =		{urn:nbn:de:0030-drops-23481},
  doi =		{10.4230/DROPS.MEMICS.2009.2348},
  annote =	{Keywords: Mean-payoff games, randomized algorithms, computational complexity}
}
Document
DOI: 10.4230/DagSemProc.08332.1
08332 Abstracts Collection – Distributed Verification and Grid Computing

Authors: Henri E. Bal, Lubos Brim, and Martin Leucker

Published in: Dagstuhl Seminar Proceedings, Volume 8332, Distributed Verification and Grid Computing (2008)

Abstract
From 08/10/2008 to 08/14/2008 the Dagstuhl Seminar 08332 ``Distributed Verification and Grid Computing'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Henri E. Bal, Lubos Brim, and Martin Leucker. 08332 Abstracts Collection – Distributed Verification and Grid Computing. In Distributed Verification and Grid Computing. Dagstuhl Seminar Proceedings, Volume 8332, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{bal_et_al:DagSemProc.08332.1,
  author =	{Bal, Henri E. and Brim, Lubos and Leucker, Martin},
  title =	{{08332 Abstracts Collection – Distributed Verification and Grid Computing}},
  booktitle =	{Distributed Verification and Grid Computing},
  pages =	{1--10},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8332},
  editor =	{Henri E. Bal and Lubos Brim and Martin Leucker},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08332.1},
  URN =		{urn:nbn:de:0030-drops-16335},
  doi =		{10.4230/DagSemProc.08332.1},
  annote =	{Keywords: Parallel Model Checking, Grid Computing, Verification}
}
Document
DOI: 10.4230/DagSemProc.08332.2
08332 Executive Summary – Distributed Verification and Grid Computing

Authors: Henri E. Bal, Lubos Brim, and Martin Leucker

Published in: Dagstuhl Seminar Proceedings, Volume 8332, Distributed Verification and Grid Computing (2008)

Abstract
The Dagstuhl Seminar on Distributed Verification and Grid Computing took place from 10.08.2008 to 14.08.2008 and brought together two groups of researchers to discuss their recent work and recent trends related to parallel verification of large scale computer systems on large scale grids. In total, 29 experts from 12 countries attended the seminar.
Cite as

Henri E. Bal, Lubos Brim, and Martin Leucker. 08332 Executive Summary – Distributed Verification and Grid Computing. In Distributed Verification and Grid Computing. Dagstuhl Seminar Proceedings, Volume 8332, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{bal_et_al:DagSemProc.08332.2,
  author =	{Bal, Henri E. and Brim, Lubos and Leucker, Martin},
  title =	{{08332 Executive Summary – Distributed Verification and Grid Computing}},
  booktitle =	{Distributed Verification and Grid Computing},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8332},
  editor =	{Henri E. Bal and Lubos Brim and Martin Leucker},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08332.2},
  URN =		{urn:nbn:de:0030-drops-16329},
  doi =		{10.4230/DagSemProc.08332.2},
  annote =	{Keywords: Grid computing, verification, parallel computing, model checking}
}
Document
DOI: 10.4230/DagSemProc.08332.4
Efficient Large-Scale Model Checking

Authors: Kees Verstoep, Henri E. Bal, Jiri Barnat, and Lubos Brim

Published in: Dagstuhl Seminar Proceedings, Volume 8332, Distributed Verification and Grid Computing (2008)

Abstract
Model checking is a popular technique to systematically and automatically verify system properties. Unfortunately, the well-known state explosion problem often limits the extent to which it can be applied to realistic specifications, due to the huge resulting memory requirements. Distributed memory model checkers exist, but have thus far only been evaluated on small-scale clusters, with mixed results. We examine one well-known distributed model checker in detail, and show how a number of additional optimizations in its runtime system enable it to efficiently check very demanding problem instances on a large-scale, multi-core compute cluster. We analyze the impact of the distributed algorithms employed, the problem instance characteristics and network overhead. Finally, we show that the model checker can even obtain good performance in a high-bandwidth computational grid environment.
Cite as

Kees Verstoep, Henri E. Bal, Jiri Barnat, and Lubos Brim. Efficient Large-Scale Model Checking. In Distributed Verification and Grid Computing. Dagstuhl Seminar Proceedings, Volume 8332, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{verstoep_et_al:DagSemProc.08332.4,
  author =	{Verstoep, Kees and Bal, Henri E. and Barnat, Jiri and Brim, Lubos},
  title =	{{Efficient Large-Scale Model Checking}},
  booktitle =	{Distributed Verification and Grid Computing},
  pages =	{1--15},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8332},
  editor =	{Henri E. Bal and Lubos Brim and Martin Leucker},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08332.4},
  URN =		{urn:nbn:de:0030-drops-16309},
  doi =		{10.4230/DagSemProc.08332.4},
  annote =	{Keywords: Distributed model checking, Grid-based model checking}
}

Brim, Lubos

Document
DOI: 10.4230/DagSemProc.09491.1
09491 Abstracts Collection – Graph Search Engineering

Authors: Lubos Brim, Stefan Edelkamp, Eric A. Hansen, and Peter Sanders

Published in: Dagstuhl Seminar Proceedings, Volume 9491, Graph Search Engineering (2010)

Abstract
From the 29th November to the 4th December 2009, the Dagstuhl Seminar 09491 ``Graph Search Engineering '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Lubos Brim, Stefan Edelkamp, Eric A. Hansen, and Peter Sanders. 09491 Abstracts Collection – Graph Search Engineering. In Graph Search Engineering. Dagstuhl Seminar Proceedings, Volume 9491, pp. 1-31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{brim_et_al:DagSemProc.09491.1,
  author =	{Brim, Lubos and Edelkamp, Stefan and Hansen, Eric A. and Sanders, Peter},
  title =	{{09491 Abstracts Collection – Graph Search Engineering}},
  booktitle =	{Graph Search Engineering},
  pages =	{1--31},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9491},
  editor =	{Lubos Brim and Stefan Edelkamp and Erik A. Hansen and Peter Sanders},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09491.1},
  URN =		{urn:nbn:de:0030-drops-24315},
  doi =		{10.4230/DagSemProc.09491.1},
  annote =	{Keywords: Model Checking, Artificial Intelligence, AI Planning, State Explosion Problem, Error Detection, Protocol Analysis, Software Verification and Validation, Heuristics, Pattern/Abstraction Databases, I/O Efficient Search, Solid State Disks, GPU}
}
Document
DOI: 10.4230/DROPS.MEMICS.2009.2348
Faster Algorithm for Mean-Payoff Games

Authors: Jakub Chaloupka and Luboš Brim

Published in: OASIcs, Volume 13, Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) (2009)

Abstract
We study some existing techniques for solving mean-payoff games (MPGs), improve them, and design a randomized algorithm for solving MPGs with currently the best expected complexity.
Cite as

Jakub Chaloupka and Luboš Brim. Faster Algorithm for Mean-Payoff Games. In Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). Open Access Series in Informatics (OASIcs), Volume 13, pp. 53-61, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{chaloupka_et_al:OASIcs:2009:DROPS.MEMICS.2009.2348,
  author =	{Chaloupka, Jakub and Brim, Lubo\v{s}},
  title =	{{Faster Algorithm for Mean-Payoff Games}},
  booktitle =	{Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09)},
  pages =	{53--61},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-15-6},
  ISSN =	{2190-6807},
  year =	{2009},
  volume =	{13},
  editor =	{Hlinen\'{y}, Petr and Maty\'{a}\v{s}, V\'{a}clav and Vojnar, Tom\'{a}\v{s}},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DROPS.MEMICS.2009.2348},
  URN =		{urn:nbn:de:0030-drops-23481},
  doi =		{10.4230/DROPS.MEMICS.2009.2348},
  annote =	{Keywords: Mean-payoff games, randomized algorithms, computational complexity}
}
Document
DOI: 10.4230/DagSemProc.08332.1
08332 Abstracts Collection – Distributed Verification and Grid Computing

Authors: Henri E. Bal, Lubos Brim, and Martin Leucker

Published in: Dagstuhl Seminar Proceedings, Volume 8332, Distributed Verification and Grid Computing (2008)

Abstract
From 08/10/2008 to 08/14/2008 the Dagstuhl Seminar 08332 ``Distributed Verification and Grid Computing'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Henri E. Bal, Lubos Brim, and Martin Leucker. 08332 Abstracts Collection – Distributed Verification and Grid Computing. In Distributed Verification and Grid Computing. Dagstuhl Seminar Proceedings, Volume 8332, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{bal_et_al:DagSemProc.08332.1,
  author =	{Bal, Henri E. and Brim, Lubos and Leucker, Martin},
  title =	{{08332 Abstracts Collection – Distributed Verification and Grid Computing}},
  booktitle =	{Distributed Verification and Grid Computing},
  pages =	{1--10},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8332},
  editor =	{Henri E. Bal and Lubos Brim and Martin Leucker},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08332.1},
  URN =		{urn:nbn:de:0030-drops-16335},
  doi =		{10.4230/DagSemProc.08332.1},
  annote =	{Keywords: Parallel Model Checking, Grid Computing, Verification}
}
Document
DOI: 10.4230/DagSemProc.08332.2
08332 Executive Summary – Distributed Verification and Grid Computing

Authors: Henri E. Bal, Lubos Brim, and Martin Leucker

Published in: Dagstuhl Seminar Proceedings, Volume 8332, Distributed Verification and Grid Computing (2008)

Abstract
The Dagstuhl Seminar on Distributed Verification and Grid Computing took place from 10.08.2008 to 14.08.2008 and brought together two groups of researchers to discuss their recent work and recent trends related to parallel verification of large scale computer systems on large scale grids. In total, 29 experts from 12 countries attended the seminar.
Cite as

Henri E. Bal, Lubos Brim, and Martin Leucker. 08332 Executive Summary – Distributed Verification and Grid Computing. In Distributed Verification and Grid Computing. Dagstuhl Seminar Proceedings, Volume 8332, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{bal_et_al:DagSemProc.08332.2,
  author =	{Bal, Henri E. and Brim, Lubos and Leucker, Martin},
  title =	{{08332 Executive Summary – Distributed Verification and Grid Computing}},
  booktitle =	{Distributed Verification and Grid Computing},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8332},
  editor =	{Henri E. Bal and Lubos Brim and Martin Leucker},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08332.2},
  URN =		{urn:nbn:de:0030-drops-16329},
  doi =		{10.4230/DagSemProc.08332.2},
  annote =	{Keywords: Grid computing, verification, parallel computing, model checking}
}
Document
DOI: 10.4230/DagSemProc.08332.4
Efficient Large-Scale Model Checking

Authors: Kees Verstoep, Henri E. Bal, Jiri Barnat, and Lubos Brim

Published in: Dagstuhl Seminar Proceedings, Volume 8332, Distributed Verification and Grid Computing (2008)

Abstract
Model checking is a popular technique to systematically and automatically verify system properties. Unfortunately, the well-known state explosion problem often limits the extent to which it can be applied to realistic specifications, due to the huge resulting memory requirements. Distributed memory model checkers exist, but have thus far only been evaluated on small-scale clusters, with mixed results. We examine one well-known distributed model checker in detail, and show how a number of additional optimizations in its runtime system enable it to efficiently check very demanding problem instances on a large-scale, multi-core compute cluster. We analyze the impact of the distributed algorithms employed, the problem instance characteristics and network overhead. Finally, we show that the model checker can even obtain good performance in a high-bandwidth computational grid environment.
Cite as

Kees Verstoep, Henri E. Bal, Jiri Barnat, and Lubos Brim. Efficient Large-Scale Model Checking. In Distributed Verification and Grid Computing. Dagstuhl Seminar Proceedings, Volume 8332, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{verstoep_et_al:DagSemProc.08332.4,
  author =	{Verstoep, Kees and Bal, Henri E. and Barnat, Jiri and Brim, Lubos},
  title =	{{Efficient Large-Scale Model Checking}},
  booktitle =	{Distributed Verification and Grid Computing},
  pages =	{1--15},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8332},
  editor =	{Henri E. Bal and Lubos Brim and Martin Leucker},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08332.4},
  URN =		{urn:nbn:de:0030-drops-16309},
  doi =		{10.4230/DagSemProc.08332.4},
  annote =	{Keywords: Distributed model checking, Grid-based model checking}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact